challeng person author flow base rank social media facetor cost ddriven explor facet queri result rank queri sourc boolean queri interfac rank support abstract onlin local data sourc provid power queri mechan limit rank capabl instanc pubm user submit highli express boolean keyword queri rank queri result date user typic prefer rank relev measur inform retriev ir rank function naiv approach submit disjunct queri queri keyword retriev return document rank oper expens due larg number result return disjunct queri paper present algorithm return top result queri rank ir style rank function oper top sourc boolean queri interfac rank capabl rank capabl interest end user algorithm gener seri conjunct queri return document candid highli rank relev metric approach appli set rank monoton set factor queri keyword ir sourc queri interfac boolean express factor comprehens experiment evalu pubm databas trec dataset show achiev order magnitud improv compar current baselin approach proxim search estim author flow abstract author flow proxim search extens measur associ entiti data graph rang web relat xml databas rank factor studi separ past addit semant differ kei advantag proxim search exist effici execut algorithm contrast due complex calcul author flow current system precomput author flow runtim limit prohibit author flow effect rank factor paper present compar analysi rank factor present effici approxim author flow base proxim search analyt estim approxim error affect rank result queri survei data manag analysi disast situat access cost dawar approach object retriev multipl sourc sourc object select retriev larg multi sourc data set fundament oper applic paper initi research effici sourc databas object select algorithm larg multi sourc data set specif order acquir number satisfi object minimum cost multipl databas queri engin determin access overhead individu data sourc overhead retriev object sourc possibl statist estim frequenc find satisfi object order determin object retriev data sourc adopt probabilist approach sourc select util cost structur dynam program model comput optim number object retriev data sourc structur valuabl asset monetari time relat cost access larg distribut databas present experiment evalu valid techniqu real world data set flexibl effici queri rank hyperlink data sourc explos hyperlink data domain biolog web express queri languag effect rank techniqu requir convert data browsabl knowledg propos graph inform discoveri gid framework support sophist user queri rich web annot hyperlink data entri queri answer rank term custom rank criteria pagerank objectrank gid data model includ schema graph data graph intuit queri interfac gid framework user easili formul queri consist sequenc hard filter select predic soft filter rank criteria combin special graph queri languag enhanc rank capabl gid queri defin semant implement set physic oper produc rank result graph discuss rewrit opportun provid effici evalu gid queri soft filter kei featur gid implement author flow rank techniqu queri depend rank expens comput runtim present approxim optim techniqu gid soft filter queri base properti random walk path length bound graphsampl approxim techniqu experiment valid optim techniqu larg biolog bibliograph dataset techniqu produc high qualiti top answer save order magnitud comparison evalu time exact solut borg block dreorgan doptim storag system paper present design implement evalu borg optim storag system perform automat block reorgan base observ workload borg motiv characterist workload uniform access frequenc distribut tempor local partial determin sequenti access achiev object borg manag small dedic partit disk drive goal servic major request partit significantli reduc seek rotat delai borg transpar rest storag stack includ applic file system schedul requir minim modif storag stack implement evalu linux implement borg real world workload includ individu user desktop environ web server virtual machin monitor svn server experi comprehens demonstr borg effect improv perform incur resourc overhead bionav effect navig queri result biomed databas abstract search queri biomed databas pubm return larg number result small subset relev user rank categor combin propos allevi inform overload problem result categor biomed databas focu work natur organ biomed citat mesh annot mesh comprehens concept hierarchi pubm paper present bionav system search interfac enabl user navig larg number queri result organ mesh concept hierarchi queri result organ navig tree node expans step bionav reveal small subset concept node select expect user navig cost minim contrast previou work expand hierarchi predefin static manner navig cost model show problem select concept reveal node expans np complet propos effici heurist feasibl optim algorithm small tree show experiment bionav outperform state art categor system respect user navig cost implement bionav medlin databas xontorank ontolog dawar search electron medic record abstract electron medic record emr widespread effect inform discoveri recent propos emr standard xml base kei characterist standard frequent ontolog refer ontolog concept code xml element associ portion emr document concept defin domain ontolog rich corpu work address search xml document work make ontolog refer enhanc search paper present xontorank system address problem ontolog awar keyword search xml document focu emr xml document current prototyp experi health level hl clinic document architectur cda releas standard emr represent systemat nomenclatur human veterinari medicin snome ontolog present techniqu result applic emr hierarch format ontolog defin concept relationship explor biomed databas bionav paper present bionav system search interfac enabl user navig larg number queri result organ mesh concept hierarchi queri result organ navig tree previou work expand hierarchi predefin static manner contrast bionav intuit navig cost model decid concept displai step kei differ previou work hierarchi strictli displai level level categori subject descriptor experi process spatial data mapreduc abstract amount inform spatial databas grow data made spatial databas store type data raster data satellit aerial digit imag vector data point line polygon complex natur spatial databas make ideal appli parallel process mapreduc emerg massiv parallel comput model propos googl work present experi appli mapreduc model solv import spatial problem bulk construct tree aerial imag qualiti comput involv vector raster data present result scalabl mapreduc effect parallel qualiti result algorithm execut googl amp ibm cluster nsf support program cluster support hadoop framework open sourc implement mapreduc result confirm excel scalabl mapreduc framework process paralleliz problem determin attribut maxim visibl object recent year signific interest develop rank function effici top retriev algorithm user ad hoc search retriev databas buyer search product catalog introduc complementari problem guid seller select attribut tupl product highlight stand crowd exist competit product wide visibl pool potenti buyer develop formul problem problem np complet give exact approxim algorithm work practic type exact algorithm base integ program ip formul problem class exact method base maxim frequent itemset mine algorithm approxim algorithm base greedi heurist detail perform studi illustr benefit method real synthet data inform discoveri multipl stream paper address issu continu keyword queri multipl textual stream explor techniqu extract inform paper repres knowledg approach perform keyword search multipl textual stream scenario intuit assum research financi analyst search inform topic continu poll data multipl possibl heterogen text stream rss feed blog topic interest lp doubl dlazi xml parser store semi dstructur data disk drive applic manag semi structur data increasingli commonplac current approach store semi structur data exist storag machineri map data relat databas combin flat file index emploi exist storag mechan provid readili solut close examin suitabl class data retrofit exist solut semi structur data result mismatch tree structur data access characterist underli storag devic disk drive studi explor possibl design space nativ storag solut semi structur data explor altern approach match applic data access characterist underli disk drive evalu effect propos nativ techniqu relat exist solut experi xml data xpathmark benchmark extens evalu reveal strength weak propos nativ data layout techniqu exist solut work deep focus queri semi structur document result retriev entir subtre propos nativ solut substanti outperform deep focus queri demonstr import deep focus nativ data layout techniqu offer uniqu direct improv perform semi structur data store varieti import workload propos nativ techniqu requir circumv current storag stack abstract investig warrant appli gener purpos storag system busi continu inform network rapid disast recoveri crisi manag disast recoveri gain immens import wake recent man natur inflict ontolog dawar search xml dbase electron medic record abstract electron medic record emr widespread effect inform discoveri recent propos emr standard xml base kei characterist frequent ontolog refer ontolog concept code xml element associ portion emr document concept defin domain ontolog paper present xontorank system tackl problem ontolog awar keyword search xml document focu emr xml document run exampl experi health level hl clinic document architectur cda releas standard emr represent systemat nomenclatur human veterinari medicin snome ontolog present techniqu result stand crowd select attribut maximum visibl abstract recent year signific interest develop rank function effici top retriev algorithm user ad hoc search retriev databas buyer search product catalog paper focu complementari problem guid seller select attribut tupl product highlight stand crowd exist competit product wide visibl pool potenti buyer develop interest formul problem problem npcomplet give exact algorithm approxim heurist work practic exact algorithm base integ program ip formul problem adapt maxim frequent itemset mine algorithm approxim algorithm base greedi heurist conduct perform studi illustr benefit method real synthet data keyword search spatial databas exist keyword search system relat databas requir user submit complet queri comput answer user feel left dark limit knowledg data method modifi queri find answer paper propos approach keyword search relat world call tastier tastier system bring instant gratif user support type ahead search find answer fly user type queri keyword main challeng achiev high interact speed larg amount data multipl tabl queri answer effici millisecond propos effici index structur algorithm find relev answer fly join tupl databas devis partit base method improv queri perform group relev tupl prune irrelev tupl effici develop techniqu answer queri effici predict highli relev complet queri user conduct experiment evalu propos techniqu real data set demonstr effici practic search paradigm explain reformul author flow queri abstract author flow effect rank mechan answer queri broad class data system develop appli principl web pagerank topic sensit pagerank bibliograph databas objectrank biolog databas hub knowledg project system drawback explain user result receiv current score author flow rate shown dramat affect result qualiti objectrank set manual domain expert queri reformul methodolog refin queri result user prefer work address shortcom introduc framework algorithm explain queri result reformul author flow queri base user feedback queri reformul process learn user prefer automat adjust author flow rate facilit person author flow search experiment evalu algorithm term perform qualiti messag dbrank program dchair author dbase keyword search databas objectrank system appli author base rank keyword search databas model label graph conceptu author origin node object keyword flow object semant connect node rank author respect extract import group data effici studi import data analysi oper extract import group data group highest aggreg valu data wareh context queri find combin product type month largest sum sale problem challeng potenti number group larger memori capac propos demand method effici top group process limit memori size design top group retriev techniqu repres scenario scenario data physic order measur propos write optim multi pass sort access algorithm wmsa exploit memori effici top group comput scenario unord data develop recurs hash algorithm rha appli hash earli aggreg coupl branch bound techniqu deriv heurist tight score bound hash partit design cluster group algorithm cga acceler top group process case data cluster subset group attribut extens experi real synthet dataset demonstr applic effici propos algorithm singl dpage web search result abstract user keyword queri current web search engin return list individu web page rank good respect queri basic unit search retriev individu page inform topic spread multipl page degrad qualiti search result long uncorrel multitop queri individu keyword rare occur document singl page satisfi user inform propos techniqu keyword queri fly gener page call compos page queri keyword compos page gener extract stitch relev piec hyperlink web page retain link origin web page rank compos page hyperlink structur origin page associ keyword page present experiment evalu heurist algorithm effici gener top compos page qualiti method compar current approach user survei final show techniqu perform queri specif summar web page index term internet search search process web search cvm commun virtual machin onlin www sciencedirect lazi xml pars abstract xml standard format data represent exchang domain rang web desktop applic wide adopt xml hinder ineffici document pars method recent work lazi pars major step allevi problem lazi parser read entir xml document order extract document structur due lack intern navig pointer insid xml document parser load pars entir virtual document tree memori xml queri process overhead significantli degrad perform navig oper develop framework effici xml pars base idea place intern physic pointer document skip larg portion document pars intern pointer gener optim pars common navig pattern doubl lazi parser lp pars document exploit intern pointer creat intern pointer construct support current xml standard studi pointer gener pars algorithm theoret experiment show perform consider exist approach star system tupl attribut rank queri answer system keyword search textual stream branch dand dbound process rank queri import rank queri numer applic involv multi criteria decis make effici support tradit databas system paper propos simpl power techniqu process queri base multidimension access method branch bound search advantag propos methodolog space effici requir singl index relat store tupl ii achiev signific order magnitud perform gain respect current state art iii effici handl data updat iv applic import variat rank search includ support monoton prefer function extra space overhead confirm superior propos method detail experiment studi proceed acm sigmod intern confer manag data system queri dspecif document summar great amount work queri independ summar document due success web search engin queri specif document summar queri result snippet import problem receiv attent present method creat queryspecif summari identifi queri relev fragment combin semant associ document add structur document preprocess stage convert document graph summari comput calcul top span tree document graph present experiment evalu effici algorithm support comput summari interact time qualiti summar method compar current approach user survei continu keyword search multipl text stream paper address issu continu keyword queri multipl textual stream explor techniqu extract inform paper repres knowledg approach perform keyword search multipl textual stream scenario intuit assum research financi analyst search inform topic continu poll data multipl possibl heterogen text stream rss feed blog topic interest commun virtual machin converg data voic multimedia commun digit network coupl continu improv network capac reliabl significantli enrich wai commun stovepip approach develop todai commun applic tool result rigid technolog limit util lengthi costli develop cycl difficulti integr hinder innov paper present fundament approach call commun virtual machin cvm address problem cvm user centric modeldriven approach conceiv synthes deliv commun solut applic domain argu cvm repres effect paradigm engin commun solut concept architectur model languag prototyp design implement cvm discuss flexibl approach electron medic record exchang methodolog propos decad integr exchang medic data progress occur due reason patient reluct give full access histor medic data institut reluct open system mediat type extern access due secur privaci hippa uniqu patient id competit advantag relat reason propos flexibl mechan electron medic record emr exchang gener custom emr gener approach independ exist healthcar applic provid demand secur effici semant agnost exchang emr collabor environ declar commun engin call commun virtual machin cvm cvm negoti capabl involv parti underli network guarante qualiti servic present compat cvm custom enforc privaci secur requir hipaa enabl log authent final provid seamlessli integr emr gener exchang healthcar provid prototyp emr exchang approach implement integr round medic record system miami children hospit syntact rule base approach toweb servic composit search web compos page databas graph pattern mine rank search graph databas domain order attribut queri result great deal interest past year rank result queri structur databas includ work probabilist inform retriev rank aggreg algorithm merg order list applic sale home car electron good data item larg number attribut displai rank list item user attribut shown tradition select manual argu automat select attribut requir deal requir user formul problem optim problem choos set attribut attribut influenti rank item discuss variant notion attribut us propos hybrid split pane approach return composit top attribut variant conduct perform user studi illustr benefit algorithm term effici qualiti explan objectrank system author dbase search databas objectrank system perform author base keyword search databas inspir pagerank pagerank excel tool rank global import page web proven success googl googl probabilist inform retriev approach rank databas queri result investig problem rank answer databas queri tupl return present methodolog tackl problem conjunct rang queri adapt appli principl probabilist model inform retriev structur data solut domain independ leverag data workload statist correl evalu qualiti approach user survei real databas present experiment evalu algorithm effici retriev top rank result demonstr feasibl rank system keyword proxim search xml tree abstract recent work shown benefit keyword proxim search queri xml document addit text document queri keyword shakespear plai xml user interest know keyword cooccur paper focu xml tree defin xml keyword proxim queri return possibl heterogen set minimum connect tree mct match individu keyword queri effici execut keyword proxim queri label tree xml set xml databas preprocess indic xml databas perform detail experiment evalu studi benefit approach show algorithm consider outperform prior algorithm applic approach structur dbase queri dspecif document summar summar text document increasingli import amount data internet larg major current approach view document linear sequenc word creat queri independ summari ignor structur document degrad qualiti summari popular web search engin requir queryspecif summari present method creat queri specif summari ad structur document extract associ fragment objectrank author dbase keyword search databas objectrank system appli author base rank keyword search databas model label graph conceptu author origin node object keyword flow object semant connect node rank author respect probabilist rank databas queri result investig problem rank answer databas queri tupl return adapt appli principl probabilist model inform retriev structur data propos solut domain independ leverag data workload statist correl rank function custom applic present result preliminari experi demonstr effici qualiti rank system algorithm applic answer rank queri rank view rank queri return top object databas prefer function present evalu experiment theoret core algorithm answer rank queri cient pipelin manner materi rank view extend core algorithm prefer merg system prefer precomput set materi view provid guarante queri perform present algorithm select optim set view space constraint describ multipl optim implement aspect download version prefer discuss merg oper meta broker answer rank queri retriev minim number object sourc er rank queri specul version pipelin algorithm keyword proxim search xml graph xkeyword effici keyword proxim queri larg xml graph databas queri simpli list keyword requir schema queri languag knowledg formul xkeyword built relat databas effici ir dstyle keyword search relat databas applic plain text coexist structur data pervas commerci relat databas manag system rdbmss gener provid queri capabl text attribut incorpor state art inform retriev ir relev rank strategi search function requir queri exact column column list keyword match system keyword proxim search xml databas ding size tree smaller size denot higher associ keyword gener true reason schema design keyword queri yanni vasili permiss copi fee part materi grant provid copi made distribut direct commerci advantag vldb copyright notic titl public date notic copi permiss larg data base endow copi republish requir fee special permiss endow proceed vldb confer berlin germani confer confer confer person sergeabiteboul person chen li person yannispapakonstantin person vasilisvassalo vldb issu year paper titl medmak author icd issu year paper author author sigmod issu year effici ir dstyle keyword search relat databas applic plain text coexist structur data pervas commerci relat databas manag system rdbmss gener provid queri capabl text attribut incorpor state art inform retriev ir relev rank strategi search function requir queri exact column column list keyword match discov keyword search relat databas discov oper relat databas facilit inform discoveri allow user issu keyword queri knowledg databas schema sql semant cach xml databas prefer system effici execut multi dparametr rank queri user optim select object appropri weight import multipl object attribut optim problem oper research appli mathemat everydai life buyer select home weight function number attribut distanc offic price area captur queri definit prefer queri weight function relat attribut deriv score tupl databas system effici produc top result prefer queri evalu weight function tupl relat prefer answer prefer queri effici materi view preprocess 